Strategic Behavior with Tight, Loose and Polarized Norms
نویسندگان
چکیده
منابع مشابه
Tight and Loose Semantics for Transformation Systems
When defining the requirements of a system, specification units typically are partial or incomplete descriptions of a system component. In this context, providing a complete description of a component means integrating all the existing partial views for that component. However, in many cases defining the semantics of this integration operation is not an easy task. In particular, this is the cas...
متن کاملTight Frame Completions with Prescribed Norms
Let H be a finite dimensional (real or complex) Hilbert space and let {ai}i=1 be a non-increasing sequence of positive numbers. Given a finite sequence of vectors F = {fi}pi=1 in H we find necessary and sufficient conditions for the existence of r ∈ N∪{∞} and a Bessel sequence G = {gi}i=1 in H such that F ∪ G is a tight frame for H and ‖gi‖ = ai for 1 ≤ i ≤ r. Moreover, in this case we compute ...
متن کاملDifferences between tight and loose cultures: a 33-nation study.
With data from 33 nations, we illustrate the differences between cultures that are tight (have many strong norms and a low tolerance of deviant behavior) versus loose (have weak social norms and a high tolerance of deviant behavior). Tightness-looseness is part of a complex, loosely integrated multilevel system that comprises distal ecological and historical threats (e.g., high population densi...
متن کاملTeaching, Leadership and School Culture – from loose to tight couplings
The Danish upper secondary school system is undergoing remarkable changes these years. The teacher's role and fundamental structures of the organization changes, as comprehensive reforms put new structures into the single school. The reform build new frames of teaching into the everyday life of the teachers and questions arise: What happens when teachers are to implement such thorough reforms, ...
متن کاملWaste Makes Haste: Tight Bounds for Loose Parallel Sorting
Conventional parallel sorting requires the n input keys to be output in an array of size n, and is known to take fl(log n/log log n) time using any polynomial number of processors. The lower bound does not apply to the more "wasteful" convention of padded sorting, which requires the keys to be output in sorted order in an array of size (1 + o(1))n. We give very fast randomized CRCW PRAM algorit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Social Science Research Network
سال: 2023
ISSN: ['1556-5068']
DOI: https://doi.org/10.2139/ssrn.4340092